Modularity-maximizing graph communities via mathematical programming
نویسندگان
چکیده
منابع مشابه
Modularity-Maximizing Graph Communities via Mathematical Programming
In many networks, it is of great interest to identify communities, unusually densely knit groups of individuals. Such communities often shed light on the function of the networks or underlying properties of the individuals. Recently, Newman suggested modularity as a natural measure of the quality of a network partitioning into communities. Since then, various algorithms have been proposed for (...
متن کاملUsing Stable Communities for Maximizing Modularity
Modularity maximization is an important problem in network analysis and is used for detecting communities in networks. However, like many other NP-hard combinatorial optimization problems, the results–the value of the modularity as well as the community membership– are affected by the order in which the vertices in the network are processed. We define stable communities as groups of vertices th...
متن کاملMaximizing Reimbursement of Indirect Costs: a Mathematical Programming Approach
One of the critical financial planning issues for governmental and not for profit organizations is how to maximize their grant rev enues. An important part of that process is maximizing the reim bursement of their indirect costs from federal and state govern ment sources. The federal government permits organizations to obtain reim bursement from the government for implementing its programs ...
متن کاملImproving Modularity in Genetic Programming Using Graph-Based Data Mining
We propose to improve the efficiency of genetic programming, a method to automatically evolve computer programs. We use graph-based data mining to identify common aspects of highly fit individuals and modularizing them by creating functions out of the subprograms identified. Empirical evaluation on the lawnmower problem shows that our approach is successful in reducing the number of generations...
متن کاملMaximizing Barber's bipartite modularity is also hard
Abstract Modularity introduced by Newman and Girvan [Phys. Rev. E 69, 026113 (2004)] is a quality function for community detection. Numerous methods for modularity maximization have been developed so far. In 2007, Barber [Phys. Rev. E 76, 066102 (2007)] introduced a variant of modularity called bipartite modularity which is appropriate for bipartite networks. Although maximizing the standard mo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The European Physical Journal B
سال: 2008
ISSN: 1434-6028,1434-6036
DOI: 10.1140/epjb/e2008-00425-1